Intuitionistic interpretation of deductive databases with incomplete information

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Intuitionistic Interpretation of Deductive Databases with Incomplete Information

Dong, F. and L.V.S. Lakshmanan, Intuitionistic interpretation of deductive databases with incomplete information, Theoretical Computer Science 133 (1994) 267-306. The aim of this paper is to build the relationship between deductive databases with incomplete information and hypothetical reasoning using embedded implications. We first consider the semantics of deductive databases with incomplete ...

متن کامل

Deductive Databases with Incomplete Information

We consider query processing in deductive databases with incomplete information in the form of null values. We motivate the problem of extracting the maximal information from a (deductive) database in response to queries, and formalize this in the form of conditional answers. We give a sound and complete top-down proof procedure for generating conditional answers. We also extend the well-known ...

متن کامل

On Deductive Database with Incomplete Information

In order to extend the ability to handle incomplete information in a definite deductive database, a Horn clause based system representing incomplete information as incomplete constants is proposed. By using the notion of incomplete constants the deductive database system handles incomplete information in the form of sets of possible values, thereby giving more information than null values. The ...

متن کامل

Extended Deductive Databases with Uncertain Information

The paper presents an approach for handling uncertain information in deductive databases using multivalued logics. Uncertainty means that database facts may be assigned logical values other than the conventional ones true and false. The logical values represent various degrees of truth, which may be combined and propagated by applying the database rules. A corresponding multivalued database sem...

متن کامل

Intuitionistic Deductive Databases and the Polynomial Time Hierarchy

Deductive databases are poor at tasks such as planning and design, where one must explore the consequences of hypothetical actions and possibilities. To address this limitation, we have developed a deductive database language in which a user can create hypotheses and draw inferences from them. In earlier work, we established initial results on the complexity and expressibility of this language....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 1994

ISSN: 0304-3975

DOI: 10.1016/0304-3975(94)90191-0